Anytime Deduction for Probabilistic Logic
نویسندگان
چکیده
This paper proposes and investigates an approach to deduction in probabilistic logic, using as its medium a language that generalizes the propositional version of Nilsson's probabilistic logic by incorporating conditional probabilities. Unlike many other approaches to deduction in probabilistic logic, this approach is based on inference rules and therefore can produce proofs to explain how conclusions are drawn. We show how these rules can be incorporated into an anytime deduction procedure that proceeds by computing increasingly narrow probability intervals that contain the tightest entailed probability interval. Since the procedure can be stopped at any time to yield partial information concerning the probability range of any entailed sentence, one can make a tradeoo between precision and computation time. The deduction method presented here contrasts with other methods whose ability to perform logical reasoning is either limited or requires nding all truth assignments consistent with the given sentences.
منابع مشابه
Anytime Decision Making with Imprecise Probabilities
This paper examines methods of decision making that are able to accommodate limitations on both the form in which uncertainty pertaining to a deci sion problem can be realistically represented and the amount of computing time available before a deci sion must be made. The methods are anytime algo "_th� in the sense of Boddy and Dean [1989] . Tech Diques are presented for use with Frisch and...
متن کاملPlan Projection as Deduction and Plan Generation as Abduction in a Context-sensitive Temporal Probability Logic
This paper presents a theoretical framework for representing plans in a context-sensitive temporal probability logic and for reasoning about plans by constructing Bayesian networks from these knowledge bases. We provide a sound and complete network construction algorithm for evaluating plans which uses context information to index only the relevant portions of the knowledge base. We formalize p...
متن کاملProbabilistic Logic Programming
We present a new approach to probabilistic logic programs with a possible worlds semantics. Classical program clauses are extended by a subinterval of [0; 1] that describes the range for the conditional probability of the head of a clause given its body. We show that deduction in the defined probabilistic logic programs is computationally more complex than deduction in classical logic programs....
متن کاملA Logic for Anytime Deduction and Anytime Compilation
One of the main characteristics of logical reasoning in knowl edge based systems is its high computational complexity Anytime de duction and anytime compilation are two attractive approaches that have been proposed for addressing such a di culty The rst one o ers a com promise between the time complexity needed to compute approximate answers and the quality of these answers The second one propo...
متن کاملApproximate anytime inference: Half an answer on time is better than a perfect answer too late
Many branches of computer science rely on logical formalisms as their foundations. Logic provides a very solid foundation on which to build new results: after 2500 years of research, logic provides us with a strong set of theoretical notions: model theory, proof theory, completeness, correctness; there exists a well established body of knowledge concerning properties such expressiveness, decida...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 69 شماره
صفحات -
تاریخ انتشار 1994